Oscilatorless Clock Multiplication

نویسندگان

  • Rui L. Aguiar
  • Dinis M. Santos
چکیده

This paper presents a technique for clock multiplication without local oscillators. This technique uses a DLL, thus presenting lower jitter than traditional PLL-based oscillator systems. Furthermore, it provides directly 50% duty-cycle clocks. This method is implemented both in a programmable custom circuit able to perform clock multiplication with integer factors from 2 to 8, and in a simpler hybrid system. Both simulations in the full-custom design and experimental results in the hybrid system support our proposal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Finite Field Multiplication Algorithm to Improve Elliptic Curve Cryptosystem Implementations

This paper presents a new and efficient implementation approach for the elliptic curve cryptosystem (ECC) based on a novel finite field multiplication in GF(2 m ) and an efficient scalar multiplication algorithm. This new finite field multiplication algorithm performs zero chain multiplication and required additions in only one clock cycle instead of several clock cycles. Using modified (limite...

متن کامل

414-bit multiplication on the ARM Cortex-M0

This thesis presents a low-level implementation of 414-bit multiplication on the ARM Cortex-M0, using four levels of Karatsuba and one level of schoolbook multiplication. This multiplication is an important part of Curve41417 created by D. Bernstein and T. Lange. This implementation requires 4014 clock cycles.

متن کامل

An Efficient Scalar Multiplication Algorithm for Elliptic Curve Cryptography Using a New Signed-Digit Representation

This paper presents and evaluates a novel encoding algorithm to reduce the Hamming weight of the scalar. The scalar multiplication is modified to utilize this new scalar representation. The results show that the computation cost (the number of required clock cycles) in the proposed scalar multiplication is effectively reduced in comparison with other modified binary scalar multiplication algori...

متن کامل

An Optimized Montgomery Modular Multiplication Algorithm for Cryptography

Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystems. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more number of addition stages for large word length additions, where n is the size of operands in bits. In this paper...

متن کامل

An RNS Based Montgomery Modular Multiplication Algorithm For Cryptography

Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystem. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more number of addition stages for large word length addition, where n is the size of operands in bits. In this paper, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001